Modeling with Indices Obtained from Complete Graphs*
نویسنده
چکیده
Modeling quality of two different algorithms for the v number, the main parameter for many molecular connectivity indices, has been tested. The new algorithms for v are able to take into account the inner-core electrons of any heteroatom with the principal quantum number n 2. Both algorithms are based on the concept of regular complete graphs, which are an appropriate tool for completing the graph representation of a molecule, extending it to the inner-core electrons of the atoms of the molecule. The model of a theoretical and two experimental properties was performed: the electron density at the bond critical point of fluorides and chlorides, the experimental lattice enthalpy of metal halides, and the experimental partition coefficient of halogenated organic compounds. The two algorithms for the v number, based on two different types of complete graphs, are tested throughout the modeling of the quantum theoretical property and of the two experimental properties. While the odd complete graphs behave better than the sequential complete graphs, both types of algorithms for v used with odd complete graphs are able to model, alternatively, the different properties in a satisfactory way.
منابع مشابه
On R degrees of vertices and R indices of graphs
Topological indices have been used to modeling biological and chemical properties of molecules in quantitive structure property relationship studies and quantitive structure activity studies. All the degree based topological indices have been defined via classical degree concept. In this paper we define a novel degree concept for a vertex of a simple connected graph: R degree. And also we defin...
متن کاملOn S Degrees of Vertices and S Indices of Graphs
Topological indices have been used to modeling biological and chemical properties of molecules in quantitive structure property relationship studies and quantitive structure activity studies. All the degree based topological indices have been defined via classical degree concept. In this paper we define a novel degree concept for a vertex of a simple connected graph: S degree. And also we defin...
متن کاملVariable Neighborhood Search for Extremal Graphs. 10. Comparison of Irregularity Indices for Chemical Trees
Chemical graphs, as other ones, are regular if all their vertices have the same degree. Otherwise, they are irregular, and it is of interest to measure their irregularity both for descriptive purposes and for QSAR/QSPR studies. Three indices have been proposed in the literature for that purpose: those of Collatz-Sinogowitz, of Albertson, and of Bell's variance of degrees. We study their propert...
متن کاملBalanced Degree-Magic Labelings of Complete Bipartite Graphs under Binary Operations
A graph is called supermagic if there is a labeling of edges where the edges are labeled with consecutive distinct positive integers such that the sum of the labels of all edges incident with any vertex is constant. A graph G is called degree-magic if there is a labeling of the edges by integers 1, 2, ..., |E(G)| such that the sum of the labels of the edges incident with any vertex v is equal t...
متن کاملSharp Upper bounds for Multiplicative Version of Degree Distance and Multiplicative Version of Gutman Index of Some Products of Graphs
In $1994,$ degree distance of a graph was introduced by Dobrynin, Kochetova and Gutman. And Gutman proposed the Gutman index of a graph in $1994.$ In this paper, we introduce the concepts of multiplicative version of degree distance and the multiplicative version of Gutman index of a graph. We find the sharp upper bound for the multiplicative version of degree distance and multiplicative ver...
متن کامل